Kinetic collision detection between two simple polygons
نویسندگان
چکیده
منابع مشابه
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision detection algorithm which uses polygon decomposition through triangle coverings and polygon influence areas (implemented by signs of barycentric coordinates). By using influence areas and the temporal and spatial coherence...
متن کاملFinding Optimal Geodesic Bridges Between Two Simple Polygons
Given two simple polygons P and Q we study the problem of finding an optimal geodesic bridge. Our problem differs from other versions of the problem where the bridge is a Euclidean bridge. An Euclidean bridge corresponds to a straight line flyover-like bridge, where as a geodesic bridge corresponds to finding a route for a ferry boat. The objective in both of these problems is to find a bridge ...
متن کاملTwo-Guard Walkability of Simple Polygons
A pair of points s and g on the boundary of a simple polygon P admits a walk if two guards can simultaneously walk along the two boundary chains of P from s to g such that they are always visible to each other. The walk is a counter-walk if one guard moves from s to g while the other moves from g to s in the same direction along the boundary and they are always visible to each other. The (count...
متن کاملKinetic Collision Detection: Algorithms and Experiments
Efficient collision detection is important in many robotic tasks, from high-level motion planning in a static environment to low-level reactive behavior in dynamic situations. Especially challenging are problems in which multiple robots are moving among multiple moving obstacles. There is extensive work on the collision detection problem in robotics as well as in other fields. Many of the succe...
متن کاملComputing the Fréchet distance between simple polygons
We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other polygon such that diagonals of the triangulation are mapped to shortest paths in the other polygon.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2003.11.001